Efficient Convexification Strategy for Generalized Geometric Programming Problems
نویسندگان
چکیده
منابع مشابه
Global optimization of fractional posynomial geometric programming problems under fuzziness
In this paper we consider a global optimization approach for solving fuzzy fractional posynomial geometric programming problems. The problem of concern involves positive trapezoidal fuzzy numbers in the objective function. For obtaining an optimal solution, Dinkelbach’s algorithm which achieves the optimal solution of the optimization problem by means of solving a sequence of subproblems ...
متن کاملGeometric Nonlinear Programming Test Problems
Convex Nonlinear Programming problems are all alike; every nonconvex problem is difficult in its own way. I am not the first numerical analyst to borrow the most quoted line of Anna Karenina to highlight the difficulties of non-linearity or non-convexity1. It could be argued that convex problems are not really “all alike”, but happy families are not either, therefore both the famous first sente...
متن کاملEfficient Approximation Schemes for Geometric Problems?
An EPTAS (efficient PTAS) is an approximation scheme where ǫ does not appear in the exponent of n, i.e., the running time is f(ǫ) ·n. We use parameterized complexity to investigate the possibility of improving the known approximation schemes for certain geometric problems to EPTAS. Answering an open question of Alber and Fiala [2], we show that Maximum Independent Set is W[1]-complete for the i...
متن کاملEfficient Algorithms for Geometric Graph Search Problems
In this paper, we show that many graph search problems can be solved quite efficiently for a geometric intersection graph ofhorizontal and vertical line segments. We first extract several basic operations for depth first search and breadth first search on a graph. Then we present data structures for the intersection graph in terms of which those operations can be implemented in an efficient man...
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Computing
سال: 2019
ISSN: 1091-9856,1526-5528
DOI: 10.1287/ijoc.2018.0850